//
// Created by ASUS on 2023/9/29.
//
#include <bits/stdc++.h>
using namespace std;

const int MX = 1001;
const int mod=1e9+7;
long long c[MX][MX];
int init = []() {
	for (int i = 0; i < MX; i++) {
		c[i][0] = c[i][i] = 1;
		for (int j = 1; j < i; j++)
			c[i][j] = (c[i - 1][j - 1] + c[i - 1][j])%mod;
	}
	return 0;
}();

int main() {
	cout<<c[100][50];
	return 0;
}